package com.mid;

/**
 * Created by Lxk on 2020/2/10.
 */
public class Solution162 {

    public int findPeakElement(int[] nums) {
        int left = 0, right = nums.length - 1;
        while (left < right) {
            int mid = left + (right - left) / 2;
            if (nums[mid] < nums[mid + 1]) {
                left = mid + 1;
            } else {
                right = mid;
            }
        }
        return left;
    }

    public static void main(String[] args) {
        int[] arr = {1, 2, 1, 3, 5, 6, 4};
        Solution162 solution162 = new Solution162();
        System.out.println(solution162.findPeakElement(arr));
    }

}
